Fast DCT domain filtering using the DCT and the DST

نویسندگان

  • Renato Keshet
  • Neri Merhav
چکیده

A method for efficient spatial domain filtering, directly in the discrete cosine transform (DCT) domain, is developed and proposed. It consists of using the discrete sine transform (DST) and the DCT for transform-domain processing on the in JPEG basis of the previously derived convolution-multiplication properties of discrete trigonometric transforms. The proposed scheme requires neither zero padding of the input data nor kernel symmetry. It is demonstrated that, in typical applications, the proposed algorithm is significantly more efficient than the conventional filtered spatial domain and earlier proposed DCT domain methods. The proposed method is applicable to any DCT-based image compression standard, such as JPEG, MPEG, and H.261.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-Focus Image Fusion in DCT Domain using Variance and Energy of Laplacian and Correlation Coefficient for Visual Sensor Networks

The purpose of multi-focus image fusion is gathering the essential information and the focused parts from the input multi-focus images into a single image. These multi-focus images are captured with different depths of focus of cameras. A lot of multi-focus image fusion techniques have been introduced using considering the focus measurement in the spatial domain. However, the multi-focus image ...

متن کامل

ImageCompression Using Real Fourier Transform, Its Wavelet Transform And Hybrid Wavelet With DCT

This paper proposes new image compression technique that uses Real Fourier Transform. Discrete Fourier Transform (DFT) contains complex exponentials. It contains both cosine and sine functions. It gives complex values in the output of Fourier Transform. To avoid these complex values in the output, complex terms in Fourier Transform are eliminated. This can be done by using coefficients of Discr...

متن کامل

A Uni ed Systolic Array for Fast Computation of the DCT/DST/DHT

This paper proposes a two-dimensional (2-D) VLSI architecture using a uni ed systolic array for fast computation of the discrete cosine transform/discrete sine transform/discrete Hartley transform (DCT/DST/DHT). The N -point discrete transform is decomposed into evenand oddnumbered frequency samples and they are computed independently at the same time. The proposed uni ed systolic array archite...

متن کامل

A Fast Algorithm for Resizing Images in the DCT Domain

Abstract For many applications such as image transmission over channels with variable bandwidths and image display on devices at different resolution levels, image resizing is widely demanding. Recently, image resizing algorithms in the compressed domain have drawn a lot of attention to computation efficiency. In this paper, an efficient image resizing algorithm based on discrete cosine transfo...

متن کامل

Fast Computing of Discrete Cosine and Sine Transforms of Types VI and VII

The Discrete Sine and Cosine Transforms (DST and DCT) have already received considerable attention due to their use in source coding. The DCT of type-II (DCT-II) is at the core of standards for image and video compression, such as JPEG, H.26x-series, and MPEG 1-4 standards. The DST of type-I was suggested as a basis for Recursive Block Coding technique. The DCT and DST of type IV are used in de...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE transactions on image processing : a publication of the IEEE Signal Processing Society

دوره 8 6  شماره 

صفحات  -

تاریخ انتشار 1999